0.11/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n026.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 16:15:59 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.37	% Number of cores: 8
0.15/0.37	% Python version: Python 3.6.8
0.15/0.37	# Version: 2.6rc1-ho
0.15/0.39	# No SInE strategy applied
0.15/0.39	# Trying AutoSched0 for 59 seconds
2.52/2.72	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
2.52/2.72	# and selection function SelectMaxLComplexAvoidPosPred.
2.52/2.72	#
2.52/2.72	# Preprocessing time       : 0.099 s
2.52/2.72	
2.52/2.72	# Proof found!
2.52/2.72	# SZS status Theorem
2.52/2.72	# SZS output start CNFRefutation
2.52/2.72	thf(conj_0, conjecture, (relati2102071307_hoare @ p @ c @ c2 @ q<=>(relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)&relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
2.52/2.72	thf(fact_1_completeness, axiom, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X11:com, X12:(list_char > int) > (list_char > int) > $o]:(relati2102071307_hoare @ X9 @ X10 @ X11 @ X12<=relati775585786_valid @ X9 @ X10 @ X11 @ X12), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_completeness)).
2.52/2.72	thf(fact_0_soundness, axiom, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X11:com, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X10 @ X11 @ X12<=relati2102071307_hoare @ X9 @ X10 @ X11 @ X12), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_soundness)).
2.52/2.72	thf(fact_8_ir__valid__decomp1, axiom, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X11:com, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X10 @ X11 @ X12=>(relati775585786_valid @ (relati1310524937decomp @ X9 @ X10 @ X11 @ X12) @ skip @ X11 @ X12&relati775585786_valid @ X9 @ X10 @ skip @ (relati1310524937decomp @ X9 @ X10 @ X11 @ X12))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_ir__valid__decomp1)).
2.52/2.72	thf(fact_9_ir__valid__decomp2, axiom, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X646:(list_char > int) > (list_char > int) > $o, X11:com, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X10 @ X11 @ X12<=(relati775585786_valid @ X9 @ X10 @ skip @ X646&relati775585786_valid @ X646 @ skip @ X11 @ X12)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_9_ir__valid__decomp2)).
2.52/2.72	thf(c_0_5, negated_conjecture, ~((relati2102071307_hoare @ p @ c @ c2 @ q<=>(relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)&relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q))), inference(assume_negation,[status(cth)],[conj_0])).
2.52/2.72	thf(c_0_6, plain, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X11:com, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X10 @ X11 @ X12=>relati2102071307_hoare @ X9 @ X10 @ X11 @ X12), inference(fof_simplification,[status(thm)],[fact_1_completeness])).
2.52/2.72	thf(c_0_7, negated_conjecture, ((~relati2102071307_hoare @ p @ c @ c2 @ q|(~relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|~relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q))&((relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|relati2102071307_hoare @ p @ c @ c2 @ q)&(relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q|relati2102071307_hoare @ p @ c @ c2 @ q))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
2.52/2.72	thf(c_0_8, plain, ![X2006:(list_char > int) > (list_char > int) > $o, X2007:com, X2008:com, X2009:(list_char > int) > (list_char > int) > $o]:(~relati775585786_valid @ X2006 @ X2007 @ X2008 @ X2009|relati2102071307_hoare @ X2006 @ X2007 @ X2008 @ X2009), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
2.52/2.72	thf(c_0_9, negated_conjecture, (~relati2102071307_hoare @ p @ c @ c2 @ q|~relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|~relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q), inference(split_conjunct,[status(thm)],[c_0_7])).
2.52/2.72	thf(c_0_10, plain, ![X5:com, X7:com, X9:(list_char > int) > (list_char > int) > $o, X12:(list_char > int) > (list_char > int) > $o]:(relati2102071307_hoare @ X9 @ X5 @ X7 @ X12|~relati775585786_valid @ X9 @ X5 @ X7 @ X12), inference(split_conjunct,[status(thm)],[c_0_8])).
2.52/2.72	thf(c_0_11, plain, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X11:com, X12:(list_char > int) > (list_char > int) > $o]:(relati2102071307_hoare @ X9 @ X10 @ X11 @ X12=>relati775585786_valid @ X9 @ X10 @ X11 @ X12), inference(fof_simplification,[status(thm)],[fact_0_soundness])).
2.52/2.72	thf(c_0_12, negated_conjecture, (~relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|~relati775585786_valid @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q|~relati2102071307_hoare @ p @ c @ c2 @ q), inference(spm,[status(thm)],[c_0_9, c_0_10])).
2.52/2.72	thf(c_0_13, plain, ![X2903:(list_char > int) > (list_char > int) > $o, X2904:com, X2905:com, X2906:(list_char > int) > (list_char > int) > $o]:((relati775585786_valid @ (relati1310524937decomp @ X2903 @ X2904 @ X2905 @ X2906) @ skip @ X2905 @ X2906|~relati775585786_valid @ X2903 @ X2904 @ X2905 @ X2906)&(relati775585786_valid @ X2903 @ X2904 @ skip @ (relati1310524937decomp @ X2903 @ X2904 @ X2905 @ X2906)|~relati775585786_valid @ X2903 @ X2904 @ X2905 @ X2906)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_ir__valid__decomp1])])])).
2.52/2.72	thf(c_0_14, plain, ![X2646:(list_char > int) > (list_char > int) > $o, X2647:com, X2648:com, X2649:(list_char > int) > (list_char > int) > $o]:(~relati2102071307_hoare @ X2646 @ X2647 @ X2648 @ X2649|relati775585786_valid @ X2646 @ X2647 @ X2648 @ X2649), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])).
2.52/2.72	thf(c_0_15, negated_conjecture, (~relati775585786_valid @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q|~relati775585786_valid @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|~relati2102071307_hoare @ p @ c @ c2 @ q), inference(spm,[status(thm)],[c_0_12, c_0_10])).
2.52/2.72	thf(c_0_16, plain, ![X5:com, X7:com, X9:(list_char > int) > (list_char > int) > $o, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ (relati1310524937decomp @ X9 @ X5 @ X7 @ X12) @ skip @ X7 @ X12|~relati775585786_valid @ X9 @ X5 @ X7 @ X12), inference(split_conjunct,[status(thm)],[c_0_13])).
2.52/2.72	thf(c_0_17, plain, ![X5:com, X7:com, X9:(list_char > int) > (list_char > int) > $o, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X5 @ X7 @ X12|~relati2102071307_hoare @ X9 @ X5 @ X7 @ X12), inference(split_conjunct,[status(thm)],[c_0_14])).
2.52/2.72	thf(c_0_18, negated_conjecture, (~relati775585786_valid @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|~relati2102071307_hoare @ p @ c @ c2 @ q), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
2.52/2.72	thf(c_0_19, plain, ![X5:com, X7:com, X9:(list_char > int) > (list_char > int) > $o, X12:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X5 @ skip @ (relati1310524937decomp @ X9 @ X5 @ X7 @ X12)|~relati775585786_valid @ X9 @ X5 @ X7 @ X12), inference(split_conjunct,[status(thm)],[c_0_13])).
2.52/2.72	thf(c_0_20, plain, ![X9:(list_char > int) > (list_char > int) > $o, X10:com, X646:(list_char > int) > (list_char > int) > $o, X11:com, X12:(list_char > int) > (list_char > int) > $o]:((relati775585786_valid @ X9 @ X10 @ skip @ X646&relati775585786_valid @ X646 @ skip @ X11 @ X12)=>relati775585786_valid @ X9 @ X10 @ X11 @ X12), inference(fof_simplification,[status(thm)],[fact_9_ir__valid__decomp2])).
2.52/2.72	thf(c_0_21, negated_conjecture, (relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q)|relati2102071307_hoare @ p @ c @ c2 @ q), inference(split_conjunct,[status(thm)],[c_0_7])).
2.52/2.72	thf(c_0_22, negated_conjecture, ~relati2102071307_hoare @ p @ c @ c2 @ q, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_17])).
2.52/2.72	thf(c_0_23, plain, ![X3115:(list_char > int) > (list_char > int) > $o, X3116:com, X3117:(list_char > int) > (list_char > int) > $o, X3118:com, X3119:(list_char > int) > (list_char > int) > $o]:(~relati775585786_valid @ X3115 @ X3116 @ skip @ X3117|~relati775585786_valid @ X3117 @ skip @ X3118 @ X3119|relati775585786_valid @ X3115 @ X3116 @ X3118 @ X3119), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])).
2.52/2.72	thf(c_0_24, negated_conjecture, relati2102071307_hoare @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q), inference(sr,[status(thm)],[c_0_21, c_0_22])).
2.52/2.72	thf(c_0_25, negated_conjecture, (relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q|relati2102071307_hoare @ p @ c @ c2 @ q), inference(split_conjunct,[status(thm)],[c_0_7])).
2.52/2.72	thf(c_0_26, plain, ![X5:com, X9:(list_char > int) > (list_char > int) > $o, X7:com, X12:(list_char > int) > (list_char > int) > $o, X193:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ X9 @ X5 @ X7 @ X193|~relati775585786_valid @ X9 @ X5 @ skip @ X12|~relati775585786_valid @ X12 @ skip @ X7 @ X193), inference(split_conjunct,[status(thm)],[c_0_23])).
2.52/2.72	thf(c_0_27, negated_conjecture, relati775585786_valid @ p @ c @ skip @ (relati1310524937decomp @ p @ c @ c2 @ q), inference(spm,[status(thm)],[c_0_17, c_0_24])).
2.52/2.72	thf(c_0_28, negated_conjecture, relati2102071307_hoare @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q, inference(sr,[status(thm)],[c_0_25, c_0_22])).
2.52/2.72	thf(c_0_29, negated_conjecture, ![X5:com, X9:(list_char > int) > (list_char > int) > $o]:(relati775585786_valid @ p @ c @ X5 @ X9|~relati775585786_valid @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ X5 @ X9), inference(spm,[status(thm)],[c_0_26, c_0_27])).
2.52/2.72	thf(c_0_30, negated_conjecture, relati775585786_valid @ (relati1310524937decomp @ p @ c @ c2 @ q) @ skip @ c2 @ q, inference(spm,[status(thm)],[c_0_17, c_0_28])).
2.52/2.72	thf(c_0_31, negated_conjecture, ~relati775585786_valid @ p @ c @ c2 @ q, inference(spm,[status(thm)],[c_0_22, c_0_10])).
2.52/2.72	thf(c_0_32, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31]), ['proof']).
2.52/2.72	# SZS output end CNFRefutation
2.52/2.72	# Proof object total steps             : 33
2.52/2.72	# Proof object clause steps            : 19
2.52/2.72	# Proof object formula steps           : 14
2.52/2.72	# Proof object conjectures             : 17
2.52/2.72	# Proof object clause conjectures      : 14
2.52/2.72	# Proof object formula conjectures     : 3
2.52/2.72	# Proof object initial clauses used    : 8
2.52/2.72	# Proof object initial formulas used   : 5
2.52/2.72	# Proof object generating inferences   : 9
2.52/2.72	# Proof object simplifying inferences  : 5
2.52/2.72	# Training examples: 0 positive, 0 negative
2.52/2.72	# Parsed axioms                        : 439
2.52/2.72	# Removed by relevancy pruning/SinE    : 0
2.52/2.72	# Initial clauses                      : 847
2.52/2.72	# Removed in clause preprocessing      : 111
2.52/2.72	# Initial clauses in saturation        : 736
2.52/2.72	# Processed clauses                    : 6774
2.52/2.72	# ...of these trivial                  : 216
2.52/2.72	# ...subsumed                          : 3221
2.52/2.72	# ...remaining for further processing  : 3337
2.52/2.72	# Other redundant clauses eliminated   : 21856
2.52/2.72	# Clauses deleted for lack of memory   : 0
2.52/2.72	# Backward-subsumed                    : 14
2.52/2.72	# Backward-rewritten                   : 609
2.52/2.72	# Generated clauses                    : 124165
2.52/2.72	# ...of the previous two non-trivial   : 79628
2.52/2.72	# Contextual simplify-reflections      : 10
2.52/2.72	# Paramodulations                      : 53820
2.52/2.72	# Factorizations                       : 26
2.52/2.72	# NegExts                              : 1076
2.52/2.72	# Equation resolutions                 : 22102
2.52/2.72	# Propositional unsat checks           : 0
2.52/2.72	#    Propositional check models        : 0
2.52/2.72	#    Propositional check unsatisfiable : 0
2.52/2.72	#    Propositional clauses             : 0
2.52/2.72	#    Propositional clauses after purity: 0
2.52/2.72	#    Propositional unsat core size     : 0
2.52/2.72	#    Propositional preprocessing time  : 0.000
2.52/2.72	#    Propositional encoding time       : 0.000
2.52/2.72	#    Propositional solver time         : 0.000
2.52/2.72	#    Success case prop preproc time    : 0.000
2.52/2.72	#    Success case prop encoding time   : 0.000
2.52/2.72	#    Success case prop solver time     : 0.000
2.52/2.72	# Current number of processed clauses  : 2632
2.52/2.72	#    Positive orientable unit clauses  : 342
2.52/2.72	#    Positive unorientable unit clauses: 14
2.52/2.72	#    Negative unit clauses             : 322
2.52/2.72	#    Non-unit-clauses                  : 1954
2.52/2.72	# Current number of unprocessed clauses: 72869
2.52/2.72	# ...number of literals in the above   : 307542
2.52/2.72	# Current number of archived formulas  : 0
2.52/2.72	# Current number of archived clauses   : 694
2.52/2.72	# Clause-clause subsumption calls (NU) : 914810
2.52/2.72	# Rec. Clause-clause subsumption calls : 457743
2.52/2.72	# Non-unit clause-clause subsumptions  : 1567
2.52/2.72	# Unit Clause-clause subsumption calls : 54786
2.52/2.72	# Rewrite failures with RHS unbound    : 75
2.52/2.72	# BW rewrite match attempts            : 11911
2.52/2.72	# BW rewrite match successes           : 143
2.52/2.72	# Condensation attempts                : 0
2.52/2.72	# Condensation successes               : 0
2.52/2.72	# Termbank termtop insertions          : 1931633
2.52/2.73	
2.52/2.73	# -------------------------------------------------
2.52/2.73	# User time                : 2.296 s
2.52/2.73	# System time              : 0.064 s
2.52/2.73	# Total time               : 2.360 s
2.52/2.73	# Maximum resident set size: 2764 pages
2.52/2.73	EOF